Improving Satisfiability Algorithms with Dominance and Partitioning
نویسندگان
چکیده
In this paper we describe how several search pruning concepts, commonly used in algorithms for solving covering problems, can be incorporated in algorithms for propositional satisfiability (SAT). In particular, we show that the concepts of row dominance and matrix partitioning, commonly used for solving unate and binate covering problems, can be naturally applied to SAT algorithms. Experimental results, conducted on a large number of benchmarks, indicate that these techniques lead to significant performance improvements for an existing SAT algorithm.
منابع مشابه
Partition-based logical reasoning for first-order and propositional theories
In this paper we provide algorithms for reasoning with partitions of related logical axioms in propositional and first-order logic (FOL). We also provide a greedy algorithm that automatically decomposes a set of logical axioms into partitions. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple knowledge bases that have overlap in content. Second, we...
متن کاملDominance Constraints and Dominance Graphs
Dominance constraints logically describe trees in terms of their adjacency and dominance, i.e. reachability, relation. They have important applications in computational linguistics. Unfortunately, the satisfiability problem of dominance constraints is NP-complete. In this extended abstract we describe efficient algorithms for natural subclasses of dominance constraints [BDNM03]. The instances o...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملAn efficient graph algorithm for dominance constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known.
متن کاملPSA - A New Scalable Space Partition Based Selection Algorithm for MOEAs
It has generally been acknowledged that both proximity to the Pareto front and a certain diversity along the front should be targeted when using evolutionary algorithms to evolve solutions to multi-objective optimization problems. Although many evolutionary algorithms are equipped with mechanisms to achieve both targets, most give priority to proximity over diversity. This priority is embedded ...
متن کامل